منابع مشابه
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملAn algorithm for computing Grobner basis and the complexity evaluation
The first Gröbner basis algorithm was constructed by Buchberger in 1965; thus it bears his name to this day – Buchberger’s algorithm.[9] Though Buchberger’s algorithm looks relatively simple, it can take a very large amount of time. The step that creates 0 h via a normal form calculation is computationally very difficult. This is particularly frustrating (and wasteful) if the normal form calcul...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملThe complexity of computing Kronecker coefficients
Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group Sn. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur polynomials in the basis of Schur polynomials. We show that the problem KRONCOEFF of computing Kronecker coefficients is very difficult. More specific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2009
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.1.60